Branch-and-price approaches for the network design problem with relays
نویسندگان
چکیده
منابع مشابه
The network design problem with relays
The network design problem with relays (NDPR) is defined on an undirected graph G = (V,E,K), where V = {1, . . . ,n} is a vertex set, E = {(i, j) : i, j 2 V, i < j} is an edge set. The set K = {(o(k),d(k))} is a set of communication pairs (or commodities): o(k) 2 V and d(k) 2 V denote the origin and the destination of the kth commodity, respectively. With each edge (i, j) are associated a cost ...
متن کاملBranch-and-Price for a Survivable Network Design Problem
We consider a specific variant of the survivable network design problem suitable to model real world scenarios occurring in the extension of fiber optic networks. In this article, two mixed integer programming models, which can be solved by branch-and-price, are discussed and compared to existing approaches theoretically as well as by a computational study. We further discuss the usage of alter...
متن کاملBranch-and-price-and-cut for a service network design and hub location problem
In the context of combined road-rail freight transport, we study the integrated tactical planning of hub locations and the design of a frequency service network. We consider a number of real-world constraints such as multiple transshipments of requests at hubs, transport time limits for requests, request splitting, and outsourcing possibilities. To our knowledge, the combination of problem feat...
متن کاملA branch-and-price approach to the feeder network design problem
In this paper we consider the problem of designing a container liner shipping feeder network. The designer has to choose which port to serve during many rotations that start and end at a central hub. Many operational characteristics are considered, such as variable leg-by-leg speeds and cargo transit times. Realistic instances are generated from the LinerLib benchmark suite. The problem is solv...
متن کاملHeuristic Branch-and-Price-and-Cut to Solve a Network Design Problem
We present a Heuristic Branch&Price&Cut (BPC) approach for a network design problem. This algorithm integrates several original features including: • a multi-commodity multi-capacity network design problem path based model, • a pricing scheme using pools of generators and promising columns, • cutting-planes applied to the path-based formulation to obtain better lower bounds, to make better heur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2018
ISSN: 0305-0548
DOI: 10.1016/j.cor.2018.01.004